ABSTRACT
This paper presents a novel approach in face digital image searching and matching. The given key image is converted into gray
scale image and after that a matrix is computed with gray scale values of the key image. Then we are collecting the diagonal
key elements for diagonal searching key sequence. Using Pair wise sequence alignment we are trying to match the key with
available images in the large data base of collection of faces. Initially we discussed various techniques used in digital image
searching and matching in this paper. This new algorithm Diagonal matrix is a new algorithm for all face images searching and
matching. Face recognition is very essential in the field of criminology. Face Image searching and matching are very difficult
task in image processing; there are several algorithms for face image matching. But still needs more optimization for image
matching. Using this new approach we can match criminal photo from a large database. Face Image recognition, feature
extraction and pattern matching needs improvements in Image processing. There are several methods for Face image searching
and matching, but we need new optimized technique for image searching and matching. This new Diagonal matrix approach is
tried to give optimized solution in Face digital image matching.
Keywords: - Image retrieval, edge detection and matching, face recognition, affine invariant, image searching and matching,
diagonal searching and pair wise alignment.